On Galois Connections between External Functions and Relational Constraints: Arity Restrictions and Operator Decompositions

نویسندگان

  • Miguel Couceiro
  • MIGUEL COUCEIRO
چکیده

We study the basic Galois connection induced by the ”satisfaction” relation between external functions An → B defined on a set A and valued in a possibly different set B, and ordered pairs (R, S) of relations R ⊆ Am and S ⊆ Bm, called relational constraints. We represent the induced Galois operators as compositions of closure operators associated with necessary and sufficient conditions describing the corresponding Galois closed sets of functions and constraints. We consider further Galois correspondences by restricting the sets of primal and dual objects to fixed arities, and present factorizations of the restricted Galois operators by means of parametrized analogues of the closures mentioned above.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Counting Homomorphisms via Hypergraph-Based Structural Restrictions

The way in which the graph structure of the constraints influences the computational complexity of counting constraint satisfaction problems (#CSPs) is well understood for constraints of bounded arity. The situation is less clear if there is no bound on the arities. Here we initiate the systematic study of these problems and identify new classes of polynomial time solvable instances based on dy...

متن کامل

Galois Connections, T-CUBES & Database Mining

Galois connections are the bread and butter of the formal concept analysis. The universe of discourse there is the collections of objects with properties. A property corresponds typically to a single-valued (.true or null) binary attribute of the object. Probably the most studied connections are the closed sets and Galois lattices. We propose a generalization of these connections to the relatio...

متن کامل

On Closed Sets of Relational Constraints and Classes of Functions Closed under Variable Substitutions

Pippenger’s Galois theory of finite functions and relational constraints is extended to the infinite case. The functions involved are functions of several variables on a set A and taking values in a possibly different set B, where any or both of A and B may be finite or infinite.

متن کامل

Function Classes and Relational Constraints Stable under Compositions with Clones

The general Galois theory for functions and relational constraints over arbitrary sets described in the authors’ previous paper is refined by imposing algebraic conditions on relations.

متن کامل

Combining Existential Rules and Description Logics (Extended Version)

Query answering under existential rules — implications with existential quantifiers in the head — is known to be decidable when imposing restrictions on the rule bodies such as frontier-guardedness [BLM10, BLMS11]. Query answering is also decidable for description logics [Baa03], which further allow disjunction and functionality constraints (assert that certain relations are functions); however...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004